Goal Dependent vs. Goal Independent Analysis of Logic Programs
نویسندگان
چکیده
Abs t r ac t . Goal independent analysis of logic programs is commonly discussed in the context of the bottom-up approach. However, while the literature is rich in descriptions of top-down analysers and their application, practical experience with bottom-up analysis is still in a preliminary stage. Moreover, the practical use of existing top-down frameworks for goal independent analysis has not been addressed in a practical system. We illustrate the efficient use of existing goal dependent, top-down frameworks for abstract interpretation in performing goal independent analyses of logic programs much the same as those usually derived from bottom-up frameworks. We present several optimizations for this flavour of top-down analysis. The approach is fully implemented within an existing top-down framework. Several implementation tradeoffs are discussed as well as the influence of domain characteristics. An experimental evaluation including a comparison with a bottom-up analysis for the domain Prop is presented. We conclude that the technique can offer advantages with respect to standard goal dependent analyses.
منابع مشابه
Exploiting Goal Independence in the Analysis of Logic Programs
t> This paper illustrates the use of a top-down framework to obtain goal independent analyses of logic programs, a task which is usually associated with the bottom-up approach. While it is well known that the bottomup approach can be used, through the magic set transformation, for goal dependent analysis, it is less known that the top-down approach can be used for goal independent analysis. The...
متن کاملLive-Structure Analysis for Logic Programming Languages with Declarations
Live-structure analysis addresses the problem of memory reuse for logic programs through program analysis rather than by run-time garbage collection. The present paper focuses on pure logic programs with declarations of modes, types, and determinism. The analysis is based on previous work for pure Prolog but introduces important innovations. First, the liveness analysis is extended to consider ...
متن کاملGoal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling
A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial point is that the analysis does not verify that an (abstract) goal does not lead to suspension but rather it infers (abstract) goals which do not lead to suspension.
متن کاملDifferential Methods In
Program analysis based on abstract interpretation has proven very useful in compilation of constraint and logic programminglanguages. Unfortunately, the traditional goal-dependent framework is inherently imprecise. This is because they handle call and return in such a way that dataaow information may be reasserted unnecessarily, leading to a loss of precision for many description domains. For a...
متن کامل